Decremental Feature-based Compaction
نویسندگان
چکیده
In this paper we present the results of repeated feature-based compaction applied as a part of DUC 2004 task 1 – 75-byte short summary, on a set of printed news stories. We report the performance of a system built using tf*idf and namedentities as the main features employed to retain the most relevant parts of text, while compacting it. Multiple stages of the compaction, whilst arriving at the final summary ensure that we retain the text based on informativeness of information from the already chosen information-rich zones. From the nature of the summaries produced at 75 bytes, we conjecture that there exists a certain threshold for compacting a news story, beyond which the quality and readability of a summary deteriorate.
منابع مشابه
Incremental and Decremental Support Vector Machine Learning
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously seen training data, in a number of steps each computed analytically. The incremental procedure is reversible, and decremental “unlearning” offers an efficient method to exactly evaluate leave-one-out generalization perfo...
متن کاملEfficient multiple incremental computation for Kernel Ridge Regression with Bayesian uncertainty modeling
Abstract—This study presents an energy-economic approach for incremental/decremental learning based on kernel ridge regression, a frequently used regressor on clouds. To avoid reanalyzing the entire dataset when data change every time, the proposed mechanism supports incremental/decremental processing for both single and multiple samples (i.e., batch processing). Moreover, incremental/decreme...
متن کاملWalsh Transform over Row Mean and Column Mean using Image Fragmentation and Energy Compaction for Image Retrieval
Always the thrust for better and faster image retrieval techniques has nourished the research in content based image retrieval. The paper presents 32 novel image retrieval techniques using the feature vectors obtained by applying Walsh transform on row mean and column mean of full image, four fragments, sixteen fragments and 64 fragments of image. All the proposed CBIR techniques are tested on ...
متن کاملIncremental and Decremental Proximal Support Vector Classification using Decay Coefficients
This paper presents an efficient approach for supporting decremental learning for incremental proximal support vector machines (SVM). The presented decremental algorithm based on decay coefficients is compared with an existing window-based decremental algorithm, and is shown to perform at a similar level in accuracy, but providing significantly better computational performance.
متن کاملA Rule Extraction Based on the Rough Set Theory with Decremental Data
In a dynamic database (DB), data deletion operations are a frequent feature of database management activities. Unfortunately, most existing DM algorithms assume that the database is static and that updating a database requires re-computation of all the patterns to enable rule extraction. Of the DM techniques available, the rough set (RS) approach is a knowledge discovery tool that can be used t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004